Rule formats for compositional non-interference properties*1
نویسندگان
چکیده
منابع مشابه
Rule Formats for Distributivity
This paper proposes rule formats for Structural Operational Semantics guaranteeing that certain binary operators are left distributive with respect to a set of binary operators. Examples of left-distributivity laws from the literature are shown to be instances of the provided formats.
متن کاملCompositional Non-Interference for Concurrent Programs via Separation and Framing
Reasoning about information flow in a concurrent setting is notoriously difficult due in part to timing channels that may leak sensitive information. In this paper, we present a compositional and flexible type-and-effect system that guarantees non-interference by disallowing potentially insecure races that can be exploited through internal timing attacks. In contrast to many previous approaches...
متن کاملRule Formats for Determinism and Idempotence
Determinism is a semantic property of (a fragment of) a language that specifies that a program cannot evolve operationally in several different ways. Idempotence is a property of binary composition operators requiring that the composition of two identical specifications or programs will result in a piece of specification or program that is equivalent to the original components. In this paper, w...
متن کاملRule Formats for Nominal Process Calculi
The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifications of NRTSs that ensure that the associated NRTS is an NTS and apply them to the operational specification of the early pi-calculus. Our study...
متن کاملA Compositional Rule for Hardware Design Refinement
We present an approach to designing veriied digital systems by a sequence of small local reenements. Reenements in this approach are not limited to a library of predeened transformations for which theorems have been previously established. Rather, the approach relies on localizing the reenement steps in such a way that they can be veriied eeciently by model checking. Toward this end, a composit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Algebraic Programming
سال: 2004
ISSN: 1567-8326
DOI: 10.1016/s1567-8326(04)00032-3